Tree-Thickness and Caterpillar-Thickness under Girth Constraints
نویسندگان
چکیده
منابع مشابه
Tree-Thickness and Caterpillar-Thickness under Girth Constraints
We study extremal problems for decomposing a connected n-vertex graph G into trees or into caterpillars. The least size of such a decomposition is the tree thickness θT(G) or caterpillar thickness θC(G). If G has girth g with g ≥ 5, then θT(G) ≤ bn/gc + 1. We conjecture that the bound holds also for g = 4 and prove it when G contains no subdivision of K2,3 with girth 4. For θC, we prove that θC...
متن کاملSeparating Thickness from Geometric Thickness
We show that graph-theoretic thickness and geometric thickness are not asymptotically equivalent: for every t, there exists a graph with thickness three and geometric thickness ≥ t.
متن کاملSeparating Geometric Thickness from Book Thickness
We show that geometric thickness and book thickness are not asymptotically equivalent: for every t, there exists a graph with geometric thickness two and book thickness ≥ t.
متن کاملStress Analysis of Rotating Thick Truncated Conical Shells with Variable Thickness under Mechanical and Thermal Loads
In this paper, thermo-elastic analysis of a rotating thick truncated conical shell subjected to the temperature gradient, internal pressure and external pressure is presented. Given the existence of shear stress in the conical shell due to thickness change along the axial direction, the governing equations are obtained based on first-order shear deformation theory (FSDT). These equations are so...
متن کاملOne-Visit Caterpillar Tree Automata
We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit automata can already, for instance, evaluate trees where the nodes represent some non-associative operations. We show that there exist regular tree languages that cannot be accepted by a one-visit automaton, thus proving ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2008
ISSN: 1077-8926
DOI: 10.37236/817